An Overview of the Kepler Conjecture
نویسندگان
چکیده
A packing of spheres is an arrangement of nonoverlapping spheres of radius 1 in Euclidean space. Each sphere is determined by its center, so equivalently it is a collection of points in Euclidean space separated by distances of at least 2. The density of a packing is defined as the lim sup of the densities of the partial packings formed by spheres inside a ball with fixed center of radius R. (By taking the lim sup, rather than lim inf as the density, we prove the Kepler conjecture in the strongest possible sense.) Defined as a limit, the density is insensitive to changes in the packing in any bounded region. For example, a finite number of spheres can be removed from the face-centered cubic packing without affecting its density.
منابع مشابه
A Proof of the Kepler Conjecture ( unabridged ) Thomas C . Hales To the memory
Historical Overview of the Kepler Conjecture This paper is the first in a series of six papers devoted to the proof of the Kepler conjecture, which asserts that no packing of congruent balls in three dimensions has density greater than the face-centered cubic packing. After some preliminary comments about the face-centered cubic and hexagonal close packings, the history of the Kepler problem is...
متن کاملIntroduction to the Flyspeck Project
This article gives an introduction to a long-term project called Flyspeck, whose purpose is to give a formal verification of the Kepler Conjecture. The Kepler Conjecture asserts that the density of a packing of equal radius balls in three dimensions cannot exceed π/ √ 18. The original proof of the Kepler Conjecture, from 1998, relies extensively on computer calculations. Because the proof relie...
متن کاملFrom Kepler to Hales , and Back to Hilbert
In layman’s terms the Kepler Conjecture from 1611 is often phrased like “There is no way to stack oranges better than greengrocers do at their fruit stands” and one might add: all over the world and for centuries already. While it is not far from the truth this is also an open invitation to a severe misunderstanding. The true Kepler Conjecture speaks about infinitely many oranges while most gro...
متن کاملA Computer Verification of the Kepler Conjecture
The Kepler conjecture asserts that the density of a packing of congruent balls in three dimensions is never greater than π/ √ 18. A computer assisted verification confirmed this conjecture in 1998. This article gives a historical introduction to the problem. It describes the procedure that converts this problem into an optimization problem in a finite number of variables and the strategies used...
متن کامل